Superlinear Speedup in Parallel Computation
نویسنده
چکیده
Speedup of a parallel computation is defined as Sp = T/Tp [2], where T is the sequential time of a problem and Tp is the parallel time to solve the same problem using p processors. Tp was argued to be no greater than P in [3]. However, in practice, people observed “superlinear speedup”, i.e. the speedup with P processors is greater than P. Two main reasons for superlinear speedup are shown in [4]. The first reason is that in search problems, the termination time can be reduced when several searches are executed at the same time. And the second one is because of more efficient utilization of resources by multiprocessors. Our experiments focus on this aspect.
منابع مشابه
Super linear speedup in a local parallel meshless solution of thermo-fluid problems
The performance of the parallel implementation of the local meshless numerical method in solving system of coupled partial differential equations is explored. Presented numerical approach makes the computation convenient for parallel implementation using OpenMP based parallelization. The numerical experiments are performed on the de Vahl Davis natural convection case, with superlinear computati...
متن کاملInherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear (and sometimes unbounded) speedup, when parallel computation is used. The computations involved are subject only to given mathematical constraints and hence do not depend on external circumstances to achieve superlinear performance. The focus here is on geometric transformations. Given a geometric object A with...
متن کاملInherently Parallel Geometric Problems
A new computational paradigm is described which o ers the possibility of superlinear (and sometimes unbounded) speedup, when parallel computation is used. The computations involved are subject only to given mathematical constraints and hence do not depend on external circumstances to achieve superlinear performance. The focus here is on geometric transformations. Given a geometric object A with...
متن کاملParallel Real - Time Computation : Sometimes Quantity Means Quality Selim
The primary purpose of parallel computation is the fast execution of computational tasks that require an inordinate amount of time to perform sequentially. As a consequence, interest in parallel computation to date has naturally focused on the speedup provided by parallel algorithms over their sequential counterparts. The thesis of this paper is that a second equally important motivation for us...
متن کاملParallel Real-Time Computation: Sometimes Quantity Means Quality
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. As a consequence, interest in parallel computation to date has naturally focused on the speedup provided by parallel algorithms over their sequential counterparts. The thesis of this paper is that a second equally important motivation for using parallel computers e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002